A Framework for Abstract Interpretation of Universal Timed Concurrent Constraint Programs

Universal timed concurrent constraint programming (utcc) is a generalization of timed ccp (tcc) aiming at modeling mobile reactive systems. In this paper we formalize a general framework for data flow analyses of utcc programs by abstract interpretation techniques. The abstract semantics we propose is compositional allowing us to reduce the complexity of data flow analyses. Furthermore it is parametric w.r.t. the abstract domain. We show that our method is sound and allows for reusing the most popular abstract domains previously defined for logic programming. Thus we illustrate a groundness analysis and then we develop a new analysis: We make use of the abstract semantics to exhibit a secrecy flaw in a security protocol. The abstract semantics allows us to get around the state-explosion problem inherent in the model of the attacker in the verification of such systems. Finally, since utcc is more general than tcc, we obtain also a framework for data flow analyses of tcc programs as a special case.